A 3-approximation algorithm for the subtree distance between phylogenies
نویسندگان
چکیده
In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known approximation algorithm is a 5-approximation. We also give a faster fixed-parameter algorithm for the rooted subtree prune and regraft distance than was previously known.
منابع مشابه
On the Linear-cost Subtree-transfer Distance between Phylogenetic Trees (revised Version of Dimacs Technical Report 97-18) 1
Di erent phylogenetic trees for the same group of species are often produced either by procedures that use diverse optimality criteria [16] or from di erent genes [12] in the study of molecular evolution. Comparing these trees to nd their similarities and dissimilarities (i.e. distance) is thus an important issue in computational molecular biology. Several distance metrics including the nearest...
متن کاملA Unifying View on Approximation and FPT of Agreement Forests
We provide a unifying view on the structure of maximum (acyclic) agreement forests of rooted and unrooted phylogenies. This enables us to obtain linearor O(n logn)-time 3-approximation and improved fixed-parameter algorithms for the subtree prune and regraft distance between two rooted phylogenies, the tree bisection and reconnection distance between two unrooted phylogenies, and the hybridizat...
متن کاملA Unifying View on Approximation and FPT of Agreement Forests (Extended Abstract⋆)
We provide a unifying view on the structure of maximum (acyclic) agreement forests of rooted and unrooted phylogenies. This enables us to obtain linearor O(n log n)-time 3-approximation and improved fixed-parameter algorithms for the subtree prune and regraft distance between two rooted phylogenies, the tree bisection and reconnection distance between two unrooted phylogenies, and the hybridiza...
متن کاملSubtree Transfer Distance For Degree-D Phylogenies
The subtree transfer (STT) distance is one of the distance metric for comparing phylogenies. Previous work on computing the STT distance considered degree-3 trees only. In this paper, we give an approximation algorithm for the STT distance for degreed trees with arbitrary d and with generalized STT operations. Also, some NP-hardness results related to STT distance are presented.
متن کاملApproximating Subtree Distances Between Phylogenies
We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between two phylogenies, which was recently shown to be NP-complete. This paper presents the first approximation result for this important tree distance. The algorithm follows a standard format for tree distances. The novel ideas are in the analysis. In the analysis, the cost of the algorithm uses a "cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 6 شماره
صفحات -
تاریخ انتشار 2008